Using learnability as a filter on factorial typology: a new approach to Anderson and Browne’s generalization
نویسندگان
چکیده
This article investigates the learnability filter (LF) hypothesis, according to which the set of logically possible grammars predicted by linguistic theory is reduced to a proper subset of learnable grammars by external principles of language learning. Anti-faithfulness constraints (Alderete, 2001a) provide a linguistic theory that predicts the existence of circular chain shifts of two segment types, including purely phonological exchanges that are unattested crosslinguistically (Anderson and Browne, 1973). Overt data representing such systems are fed into a standard OT learning model in which learners have IO-antifaithfulness constraints at their disposal. Despite this evidence and these constraints, learners always select grammars in which segmental exchanges are restricted to morphologically defined environments, consistent with typological findings. These results are shown to have implications for the nature of constraints in Optimality Theory, the correct analysis of morpho-phonological alternations, and a host of representational assumptions in phonology and morphology.
منابع مشابه
Statistical learning theory and linguistic typology: a learnability perspective on OT’s strict domination
This paper develops a learnability argument for strict domination by looking at the generalization error of learners trained on OT and HG target grammars. The argument is based on both a review of error bounds in the recent statistical learning literature and simulation results on realistic phonological test cases.
متن کاملLanguage Review/A New Approach to the Systematic Typology of Languages: Introduction and Review of Fundamentals of Linguistic Typology, Rafe’eh Khoshkhoo
متن کامل
Unscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filters
The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...
متن کاملRobust Tracking Control of Satellite Attitude Using New EKF for Large Rotational Maneuvers
Control of a class of uncertain nonlinear systems, which estimates unavailable state variables, is considered. A new approach for robust tracking control problem of satellite for large rotational maneuvers is presented in this paper. The features of this approach include a strong algorithm to estimate attitude, based on discrete extended Kalman filter combined with a continuous extended Kalman ...
متن کاملBruce Tesar and Paul Smolensky ( 2000 ) . Learnability in Optimality
This review is not only for people interested in learnability in OT, but for everybody who believes in OT’s claim of FACTORIAL TYPOLOGY, i.e. the prediction that all language types generated by a permutation of the rankings of the constraints are attestable human languages. Learnability considerations are capable of shooting holes in that claim. As the study of formal models of language acquisi...
متن کامل